Constituency and Recursion in Language
نویسندگان
چکیده
artificial languages, Christiansen and Chater (1999) show that the SRN’s general pattern of performance is relatively invariant across network size and training corpus, and conclude that the human-like pattern of performance derive from intrinsic constraints inherent in the SRN architecture. Connectionist models of recursive syntax typically use “toy” fragments of grammar and small vocabularies. Aside from raising concerns over scalingup, this makes it difficult to provide detailed fits with empirical data. Nonetheless, some attempts have recently been made toward fitting existing data and deriving new empirical predictions from the models. For example, the Christiansen and Chater (1999) SRN model fits grammaticality ratings data from several behavioral experiments, including an account of the relative processing difficulty associated with the processing center-embeddings (with the following relationship between nouns and verbs: N1N2N3V3V2V1) vs. cross-dependencies (with the following relationship between nouns and verbs: N1N2N3V1V2V3). Human data have shown that sentences with two centerembeddings (in German) were significantly harder to process than comparable sentences with two cross-dependencies (in Dutch). The simulation results demonstrated that the SRNs exhibited the same kind of qualitative processing difficulties as humans on these two types of complex recursive constructions. Just as the radical connectionist approach to constituency deviates from classical constituency, the above approach to recursion deviates from the classical notion of recursion. The radical models of recursion do not acquire “true” recursion because they are unable to process infinitely complex recursive constructions. However, the classic notion of recursion may be illsuited for capturing human recursive abilities. Indeed, the psycholinguistic data suggest that people’s performance may be better construed as being only “quasi-recursive”. The earlier mentioned semantic facilitation of recursive processing further suggests that human recursive performance may be partially context-sensitive; for example, the semantically biased ‘The bees that the hive that the farmer built housed stung the children’ is easier to comprehend than neutral ‘The chef that the waiter that the busboy offended appreciated admired the musicians’ even though both sentences contain two center-embeddings. This dovetails with the context-sensitive notion of constituency, and suggests that context-sensitivity may be a more pervasive feature of language processing than typically assumed by symbolic approaches.
منابع مشابه
تبدیل خودکار درختبانک وابستگی فارسی به درختبانک سازهای
There are two major types of treebanks: dependency-based and constituency-based. Both of them have applications in natural language processing and computational linguistics. Several dependency treebanks have been developed for Persian. However, there is no available big size constituency treebank for this language. In this paper, we aim to propose an algorithm for automatic conversion of a depe...
متن کاملConstituency-Tree Recursive Neural Network for Quiz Bowl Answering
Quiz bowl answering represents a challenging task in natural language processing where few indication entities of answers are given in the questions. Traditional approaches such as manual feature engineering and bag of words representations can fail to reason the correct answers due to such lack of direct indications. Recently recursive neural network (RNN) model shows promising performance in ...
متن کاملA Minimal Span-Based Neural Constituency Parser
In this work, we present a minimal neural model for constituency parsing based on independent scoring of labels and spans. We show that this model is not only compatible with classical dynamic programming techniques, but also admits a novel greedy top-down inference algorithm based on recursive partitioning of the input. We demonstrate empirically that both prediction schemes are competitive wi...
متن کاملA Multi-Teraflop Constituency Parser using GPUs
Constituency parsing with rich grammars remains a computational challenge. Graphics Processing Units (GPUs) have previously been used to accelerate CKY chart evaluation, but gains over CPU parsers were modest. In this paper, we describe a collection of new techniques that enable chart evaluation at close to the GPU’s practical maximum speed (a Teraflop), or around a half-trillion rule evaluatio...
متن کاملParsing Russian: a hybrid approach
We present an approach for natural language parsing in which dependency and constituency parses are acquired simultaneously. This leads to accurate parses represented in a specific way, richer than constituency or dependency tree. It also allows reducing parsing time complexity. Within the proposed approach, we show how to treat some significant phenomena of the Russian language and also perfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002